QUANTUM INSPIRED EVOLUTIONARY ALGORITHM FOR SOLVING MULTIPLE TRAVELLING SALESMAN PROBLEM
نویسندگان
چکیده
منابع مشابه
Evolutionary algorithm and decisional DNA for multiple travelling salesman problem
In the real world, it is common to face optimization problems that have two or more objectives that must be optimized at the same time, that are typically explained in different units, and are in conflict with one another. This paper presents a hybrid structure that combines set of experience knowledge structures (SOEKS) and evolutionary algorithms, NSGA-II (Non-dominated Sorting Genetic Algori...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملBalanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm
We present an improved hybrid genetic algorithm to solve the two-dimensional Euclidean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2013
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2013.0214010